Minimal Periodical Representations of Calendar Expressions

نویسندگان

  • Claudio Bettini
  • Sergio Mascetti
چکیده

The formalization of time granularity, the study of computational methods to manipulate granularities and their applications have been the subject of much research in the recent years. This paper aims at filling the gap between symbolic representations defined thrugh calendar algebras and mathematical representations defined through periodical sets of instants. Considering a specific calendar algebra, the paper shows how each algebraic operator changes the periodical structure of the granularities given as operands. This leads to a conversion procedure between calendar expressions and periodical representations of granularities. From a practical point of view, our results allow users to specify granularities using the algebra (which is more natural) and to process them as periodical sets (as most current computational methods do). The paper also shows experimental evidence that the provided mapping is in most cases optimal and presents an efficient post-processing method for those cases where optimality must be always guaranteed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Minimal Periodical Representation of Calendar Expressions

This paper reports recent results on deriving mathematical (periodical) representations of time granularities from more user friendly algebraic expressions. The practical application of these results can be found in using systems for solving multi-granularity temporal constraint satisfaction problems. Indeed, while these systems in principle allow users to specify distance constraints in terms ...

متن کامل

Supporting Temporal Reasoning by Mapping Calendar Expressions to Minimal Periodic Sets

In the recent years several research efforts have focused on the concept of time granularity and its applications. A first stream of research investigated the mathematical models behind the notion of granularity and the algorithms to manage temporal data based on those models. A second stream of research investigated symbolic formalisms providing a set of algebraic operators to define granulari...

متن کامل

Towards modeling the semantics of calendar expressions as extended regular expressions

This paper proposes modeling the semantics of natural-language calendar expressions as extended regular expressions (XREs). The approach covers expressions ranging from plain dates to such ones as the second Tuesday following Easter. The paper presents basic calendar XRE constructs, sample calendar expressions with their representations as XREs, and possible applications in reasoning and natura...

متن کامل

Groups with Two Extreme Character Degrees and their Minimal Faithful Representations

for a finite group G, we denote by p(G) the minimal degree of faithful permutation representations of G, and denote by c(G), the minimal degree of faithful representation of G by quasi-permutation matrices over the complex field C. In this paper we will assume that, G is a p-group of exponent p and class 2, where p is prime and cd(G) = {1, |G : Z(G)|^1/2}. Then we will s...

متن کامل

On minimal degrees of faithful quasi-permutation representations of nilpotent groups

By a quasi-permutation matrix, we mean a square non-singular matrix over the complex field with non-negative integral trace....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005